Growing random sequences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FURTHER RESULTS OF CONVERGENCE OF UNCERTAIN RANDOM SEQUENCES

Convergence is an issue being widely concerned about. Thus, in this paper, we mainly put forward two types of concepts of convergence in mean and convergence in distribution for the sequence of uncertain random variables. Then some of theorems are proved to show the relations among the three convergence concepts that are convergence in mean, convergence in measure and convergence in distributio...

متن کامل

Nonrandom Sequences between Random Sequences

Let us say that an infinite binary sequence q lies above an infinite binary sequence p if q can be obtained from p by replacing selected 0’s in p by 1’s. We show that above any infinite binary Martin-Löf random sequence p there exists an infinite binary nonrandom sequence q above which there exists an infinite binary random sequence r. This result is of interest especially in connection with th...

متن کامل

Mathematics of Random Growing Interfaces

We establish a thermodynamic limit and Gaussian fluctuations for the height and surface width of the random interface formed by the deposition of particles on surfaces. The results hold for the standard ballistic deposition model as well as the surface relaxation model in the off-lattice setting. The results are proved with the aid of general limit theorems for stabilizing functionals of marked...

متن کامل

An Example of Graph Limits of Growing Sequences of Random Graphs

We consider in this note a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary distribution (depending on the number of existing vertices). Examples from this class turn out to be the Erdős–Rényi random graph, a natural random...

متن کامل

Growing random networks under constraints

In recent years measurements on a wide variety of networks such as the world wide web [13,2], the internet backbone [4], social networks [3,24,26] and metabolic networks [14,25] have shown that they differ significantly from the classic Erdos-Renyi model of random graphs [17]. While the traditional Erdos-Renyi model has a Poisson link distribution, with most nodes having a characteristic number...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and General

سال: 2004

ISSN: 0305-4470,1361-6447

DOI: 10.1088/0305-4470/37/6/026